Equilibrium points of an AND–OR tree: Under constraints on probability
نویسندگان
چکیده
منابع مشابه
Equilibrium Points of an AND-OR Tree: under Constraints on Probability
We study a probability distribution d on the truth assignments to a uniform binary AND-OR tree. Liu and Tanaka [2007, Inform. Process. Lett.] showed the following: If d achieves the equilibrium among independent distributions (ID) then d is an independent identical distribution (IID). We show a stronger form of the above result. Given a real number r such that 0 < r < 1, we consider a constrain...
متن کاملProbability Distributions Achieving the Equilibrium of an AND-OR Tree under Directional Algorithms
Consider a probability distribution d on the truth assignments to a perfect binary AND-OR tree. Liu and Tanaka (2007) extends the work of Saks and Wigderson (1986), and they characterize the eigen-distribution, the distribution achieving the equilibrium, as the uniform distribution on the 1-set (the set of all reluctant assignments for which the root has the value 1). We show that the uniquenes...
متن کاملOn M -stationary Points for a Stochastic Equilibrium Problem under Equilibrium Constraints in Electricity Spot Market Modeling*
Abstract. Modeling several competitive leaders and followers acting in an electricity market leads to coupled systems of mathematical programs with equilibrium constraints, called equilibrium problems with equilibrium constraints (EPECs). We consider a simplified model for competition in electricity markets under uncertainty of demand in an electricity network as a (stochastic) multi-leader-fol...
متن کاملComputing probability intervals under independency constraints
Many AI researchers argue that probability theory is only capable of dealing with uncertainty in situations where a fully specified joint probability distribution is available, and conclude that it is not suitable for application in AI systems. Probability intervals, however, constitute a means for expressing incompleteness of information. We present a method for computing probability interval!...
متن کاملExact Bipartite Crossing Minimization under Tree Constraints
A tanglegram consists of a pair of (not necessarily binary) trees. Additional edges, called tangles, may connect the leaves of the first with those of the second tree. The task is to draw a tanglegram with a minimum number of tangle crossings while making sure that the trees are drawn crossing-free. This problem has relevant applications in computational biology, e.g., for the comparison of phy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2015
ISSN: 0168-0072
DOI: 10.1016/j.apal.2015.07.002